On the conjugacy problem in subdirect products
نویسندگان
چکیده
منابع مشابه
The Conjugacy Problem for Finite Graph Products
A finite graph product is the fundamental group of a finite graph of groups. Finite graph products with finite cyclic edge groups are shown to inherit a solvable conjugacy problem from their vertex groups under certain conditions, of which the most important is that all the edge group generators in each vertex group are powers of a common central element.
متن کاملSubdirect Products of Semirings
Bandelt and Petrich (1982) proved that an inversive semiring S is a subdirect product of a distributive lattice and a ring if and only if S satisfies certain conditions. The aim of this paper is to obtain a generalized version of this result. The main purpose of this paper however, is to investigate, what new necessary and sufficient conditions need we impose on an inversive semiring, so that, ...
متن کاملThe Conjugacy Problem in Wreath Products and Free Metabelian Groups
1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...
متن کاملMaximal n-generated subdirect products
For n a positive integer and K a finite set of finite algebras, let L(n,K) denote the largest n-generated subdirect product whose subdirect factors are algebras in K. When K is the set of all ngenerated subdirectly irreducible algebras in a locally finite variety V, then L(n,K) is the free algebra FV(n) on n free generators for V. For a finite algebra A the algebra L(n, {A}) is the largest n-ge...
متن کاملThe Conjugacy Problem for Graph Products with Cyclic Edge Groups
A graph product is the fundamental group of a graph of groups Amongst the simplest examples are HNN groups and free products with amalgamation. The conjugacy problem is solvable for recursively presented graph products with cyclic edge groups over finite graphs if the vertex groups have solvable conjugacy problem and the sets of cyclic generators in them are semicritical. For graph products ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Education of the Bauman MSTU
سال: 2013
ISSN: 1994-0408
DOI: 10.7463/0413.0554654